Blossom Tree Graphical Models
نویسندگان
چکیده
We combine the ideas behind trees and Gaussian graphical models to form a new nonparametric family of graphical models. Our approach is to attach nonparanormal “blossoms”, with arbitrary graphs, to a collection of nonparametric trees. The tree edges are chosen to connect variables that most violate joint Gaussianity. The non-tree edges are partitioned into disjoint groups, and assigned to tree nodes using a nonparametric partial correlation statistic. A nonparanormal blossom is then “grown” for each group using established methods based on the graphical lasso. The result is a factorization with respect to the union of the tree branches and blossoms, defining a high-dimensional joint density that can be efficiently estimated and evaluated on test points. Theoretical properties and experiments with simulated and real data demonstrate the effectiveness of blossom trees.
منابع مشابه
Minimum Weight Perfect Matching via Blossom Belief Propagation
Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment over a distribution represented by a Graphical Model (GM). It has been shown that BP can solve a number of combinatorial optimization problems including minimum weight matching, shortest path, network flow and vertex cover under the following common assumption: the re...
متن کاملImpact of Climate Variability on Flowering Phenology and Its Implications for the Schedule of Blossom Festivals
Many tourism destinations characterized by spring blossom festivals (e.g., cherry blossom festival) became increasingly popular around the world. Usually, spring blossom festivals should be planned within the flowering period of specific ornamental plants. In the context of climate and phenological change, whether the administrators of tourism destinations had perceived and responded to the flo...
متن کاملGraphical Models as Block-Tree Graphs
We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge always have at least one common node. When compared to junction-trees, we show ...
متن کاملFruit Development and Some Tree Factors Affecting It
The rate and duration of apple fruit growth, cell division, and cell expansion, were considered in relation to within-tree factors affecting them. Fruit size at harvest was found to be related to the position of fruit on the spur, seed number, spur size, number of fruits set on the spur, and the date of flowering. The position of fruit on the spur, and spur size, were related to blossom size, b...
متن کاملApproximate Inference in Graphical Models using Tensor Decompositions
We demonstrate that tensor decompositions can be used to transform graphical models into structurally simpler graphical models that approximate the same joint probability distribution. In this way, standard inference algorithms such as the junction tree algorithm, can be used in order to use the transformed graphical model for approximate inference. The usefulness of the technique is demonstrat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014